Fortran 90 modules by Ernst Meese for the compressed sparse row (CSR) and the modified sparse row (MSR) data storage formats, a very general incomplete LU factorisation routine, the Krylov subspace solvers CGS, BiCGSTAB and GMRES.
The optimqr program will read a description of the sparsity pattern of some system matrix for system of linear equations. It will then apply heuristic branch and bound search to find a near-optimal ordering of the rows and columns of the system matrix...
Code by Yousef Saad and Jun Zhang to solve general sparse linear systems by using Krylov subspace methods preconditioned by some multi-level block ILU (BILUM) preconditioning techniques.
Comprised of four numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse matrices using double precision Fortran 77.